Clique transversal and clique independence on comparability graphsBALACHANDRAN, V; NAGAVAMSI, P; PANDU RANGAN, C et al.Information processing letters. 1996, Vol 58, Num 4, pp 181-184, issn 0020-0190Article

Interval graphs and searchingKIROUSIS, L. M; PAPADIMITRIOU, C. H.Discrete mathematics. 1985, Vol 55, Num 2, pp 181-184, issn 0012-365XArticle

A framework for complexity management in graph visualizationDOGRUSOZ, Ugur; GENC, Burkay.Lecture notes in computer science. 2002, pp 368-369, issn 0302-9743, isbn 3-540-00158-1, 2 p.Conference Paper

On the altitude of specified nodes in random treesPRODINGER, H.Journal of graph theory. 1984, Vol 8, Num 4, pp 481-485, issn 0364-9024Article

On the average number of nodes in a subtree of a treeJAMISON, R. E.Journal of combinatorial theory. Series B. 1983, Vol 35, Num 3, pp 207-223, issn 0095-8956Article

Reliability measures of E-graphsMAJUMDAR, A; GHOSHAL, J.Zeitschrift für angewandte Mathematik und Mechanik. 1996, Vol 76, pp 507-508, issn 0044-2267, SUP3Conference Paper

Monotonicity of the mean order of subtreesJAMISON, R. E.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 1, pp 70-78, issn 0095-8956Article

Online channel allocation in FDMA networks with reuse constraintsFEDER, T; SHENDE, S. M.Information processing letters. 1998, Vol 67, Num 6, pp 295-302, issn 0020-0190Article

EDGE DISJOINT PLACEMENT OF GRAPHSSAUER N; SPENCER J.1978; J. COMBINATOR. THEORY, B; USA; DA. 1978; VOL. 25; NO 3; PP. 295-302; BIBL. 3 REF.Article

A NOTE ON COMPACT SETS IN GRAPHSLODI E; LUCCIO F.1978; RIC. DI AUTOMAT.; ITA; DA. 1978; VOL. 9; NO 1; PP. 86-91; BIBL. 1 REF.Article

THE LARGEST VERTEX DEGREE SUM FOR A TRIANGLE IN A GRAPH.EDWARDS CS.1977; BULL. LONDON MATH. SOC.; G.B.; DA. 1977; VOL. 9; NO 26; PP. 203-208; BIBL. 1 REF.Article

ON PROBLEMS RELATED TO CHARACTERISTIC VERTICES OF GRAPHSSZAMKOLOWICZ L.1979; COLLOQ. MATH.; POL; DA. 1979; VOL. 42; PP. 367-375; BIBL. 3 REF.Article

DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN, MAXIMAL DEGREE.BOLLOBAS B.1977; QUART. J. MATH.; G.B.; DA. 1977; VOL. 28; NO 109; PP. 81-85; BIBL. 9 REF.Article

LINE REMOVAL ALGORITHMS FOR GRAPHS AND THEIR DEGREE LISTS.BOESCH F; HARARY F.1976; I.E.E.E. TRANS. CIRCUITS SYST.; U.S.A.; DA. 1976; VOL. 23; NO 12; PP. 778-782; BIBL. 13 REF.Article

VERTEX-CRITICAL GRAPHS OF GIVEN DIAMETER.GLIVIAK F.1976; ACTA MATH. ACAD. SCI. HUNGAR.; HONGR.; DA. 1976; VOL. 27; NO 3-4; PP. 255-262; BIBL. 8 REF.Article

F-SETS IN GRAPHS.KRISHNAMOORTHY V; PARTHASARATHY KR.1978; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1978; VOL. 24; NO 1; PP. 53-60; BIBL. 3 REF.Article

ON A NEW INDEX FOR CHARACTERISING THE VERTICES OF CERTAIN NON-BIPARTITE GRAPHSMALLION RB; ROUVRAY DH.1978; STUD. SCI. MATH. HUNG.; ISSN 0081-6906; HUN; DA. 1978 PUBL. 1981; VOL. 13; NO 1-2; PP. 229-243; BIBL. 25 REF.Article

UPPER BOUNDS FOR THE STABILITY NUMBER OF A GRAPHHANSEN P.1979; REV. ROUMAINE MATH. PURES APPL.; ROM; DA. 1979; VOL. 24; NO 8; PP. 1195-1199; BIBL. 6 REF.Article

UEBER N-FACH ZUSAMMENHAENGENDE ECKENMENGEN IN GRAPHEN. = SUR DES ENSEMBLES DE NOEUDS N-CONNEXES DANS DES GRAPHESMADER W.1978; J. COMBINATOR THEORY; USA; DA. 1978; VOL. 25; NO 1; PP. 74-93; ABS. ENG; BIBL. 15 REF.Article

VERTEX DEGREES OF PLANAR GRAPHSCOOK RJ.1979; J. COMBINATOR. THEORY, B; USA; DA. 1979; VOL. 26; NO 3; PP. 337-345; BIBL. 1 REF.Article

ENUMERATING A CLASS OF NESTED GROUP TESTING PROCEDURES.MOON JW; SOBEL M.1977; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1977; VOL. 23; NO 2-3; PP. 184-188; BIBL. 3 REF.Article

SUI VERTICI E SUGLI SPIGOLI QUASI CRITICI DI UN GRAFO. = SUR LES NOEUDS ET LES COTES QUASI CRITIQUES D'UN GRAPHEDE FLORA A.1975; RIV. MAT. UNIV. PARMA; ITAL.; DA. 1975 PARU 1977; VOL. 4; NO 1; PP. 233-237; ABS. ANGL.; BIBL. 2 REF.Article

MINIMAL SEPARATING SETS OF MAXIMUM SIZEALAVI Y; NEHZAD M; NORDHAUS EA et al.1980; J. COMBINATOR. THEORY, B; USA; DA. 1980; VOL. 28; NO 2; PP. 180-183; BIBL. 6 REF.Article

REFINED VERTEX CODES AND VERTEX PARTITIONING METHODOLOGY FOR GRAPH ISOMORPHISM TESTINGBHAT KVS.1980; IEEE TRANS. SYST. MAN CYBERN.; ISSN 0018-9472; USA; DA. 1980; VOL. 10; NO 10; PP. 610-615; BIBL. 37 REF.Article

ON MAXIMAL INDEPENDENT SETS OF VERTICES IN CLAW-FREE GRAPHSMINTY GJ.1980; J. COMBINATOR. THEORY, B; USA; DA. 1980; VOL. 28; NO 3; PP. 284-304; BIBL. 15 REF.Article